Speed function for biased random walks with traps
نویسندگان
چکیده
We consider a biased nearest-neighbor random walk on Z which at each step is trapped for some time with random, site-dependent mean. derive simple formula the speed function in terms of model parameters.
منابع مشابه
Biased Random Walks in Biology
Random walks are used to describe the trajectories of many motile animals and microorganisms. They are a useful tool for both qualitative and quantitative descriptions of the behaviour of such creatures. Simple diffusive random walk models, or position jump processes, are unrealistic as they allow for effectively infinite propagation and do not take into account correlation between steps. Othme...
متن کاملUsing Biased Random Walks for Focused Summarization
We introduce a graph-based sentence ranking algorithm for extractive summarization. Our method is a version of the LexRank algorithm we introduced in DUC 2004 extended to the focused summarization task of DUC 2006. As in LexRank, we represent the set of sentences in a document cluster as a graph, where nodes are sentences and links between the nodes are induced by a similarity relation between ...
متن کاملEfficiency of message transmission using biased random walks in complex networks in the presence of traps.
We study the problem of a particle or message that travels as a biased random walk towards a target node in a network in the presence of traps. The bias is represented as the probability p of the particle to travel along the shortest path to the target node. The efficiency of the transmission process is expressed through the fraction f(g) of particles that succeed to reach the target without be...
متن کاملBiased Random Walks on Galton - Watson Trees
We consider random walks with a bias toward the root on the family tree T of a supercritical Galton-Watson branching process and show that the speed is positive whenever the walk is transient. The corresponding harmonic measures are carried by subsets of the boundary of dimension smaller than that of the whole boundary. When the bias is directed away from the root and the extinction probability...
متن کاملBounds on Biased and Unbiased Random Walks
We analyze several random random walks on one-dimensional lattices using spectral analysis and probabilistic methods. Through our analysis, we develop insight into the pre-asymptotic convergence of Markov chains.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2023
ISSN: ['1879-2103', '0167-7152']
DOI: https://doi.org/10.1016/j.spl.2022.109765